Proof-Theoretic Methods for Analysis of Functional Programs
نویسنده
چکیده
We investigate how, in a natural deduction setting, we can specify concisely a wide variety of tasks that manipulate programs as data objects. This study will provide us with a better understanding of various kinds of manipulations of programs and also an operational understanding of numerous features and properties of a rich functional programming language. We present a technique, inspired by structural operational semantics and natural semantics, for specifying properties of, or operations on, programs. Specifications of this sort are presented as sets of inference rules and are encoded as clauses in a higher-order, intuitionistic meta-logic. Program properties are then proved by constructing proofs in this meta-logic. We argue the following points regarding these specifications and their proofs: (i) the specifications are clear and concise and they provide intuitive descriptions of the properties being described; (ii) a wide variety of program analysis tools can be specified in a single unified framework, and thus we can investigate and understand the relationship between various tools; (iii) proof theory provides a well-established and formal setting in which to examine metatheoretic properties of these specifications; and (iv) the meta-logic we use can be implemented naturally in an extended logic programming language and thus we can produce experimental implementations of the specifications. We expect that our efforts will provide new perspectives and insights for many program manipulation tasks. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-89-07. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/776 PROOF-THEORETIC METHODS FOR ANALYSIS OF FUNCTIONAL PROGRAMS (Dissertation Proposal) , John 3. Hannan MS-CIS-89-07 LlNC LAB 142 Department of Computer and Information Science School of Engineering and Applied Science University of Pennsylvania Philadelphia, PA 191 04
منابع مشابه
A SHORT PROOF FOR THE EXISTENCE OF HAAR MEASURE ON COMMUTATIVE HYPERGROUPS
In this short note, we have given a short proof for the existence of the Haar measure on commutative locally compact hypergroups based on functional analysis methods by using Markov-Kakutani fixed point theorem.
متن کاملFirst steps into metapredicativity in explicit mathematics
Metapredicativity is a new general term in proof theory which describes the analysis and study of formal systems whose proof-theoretic strength is beyond the Feferman-Schütte ordinal Γ0 but which are nevertheless amenable to purely predicative methods. Typical examples of formal systems which are apt for scaling the initial part of metapredicativity are the transfinitely iterated fixed point th...
متن کاملA Proof Theoretic Approach to Failure in Functional Logic Programming
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic perspective. The starting point of our work is CRWL (Constructor based ReWriting Logic), a well established theoretical framework for functional logic programming, whose fundamental notion is that of non-strict non-determ...
متن کاملA Proof Tool for Reasoning About Functional Programs
This paper describes a system to support reasoning about lazy functional programs. We describe an approach based on combining a deep embedding of the language in HOL and a set of proof tools to raise the level of interaction with the theorem prover. This approach allows meta-theoretic reasoning about the semantics and reasoning about unde-ned programs while still supporting practical reasoning ...
متن کاملSubject Reduction of Logic Programs as Proof-Theoretic Property
We consider prescriptive type systems for logic programs (as in Gödel or Mercury). In such systems, the typing is static, but it guarantees an operational property: if a program is “well-typed”, then all derivations starting in a “well-typed” query are again “well-typed”. This property has been called subject reduction. We show that this property can also be phrased as a property of the proof-t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014